High-Performance Clock Routing Based on Recursive Geometric Matching
نویسندگان
چکیده
Minimizing clock skew is a very important problem in the design of high performance VLSI systems. We present a general clock routing scheme that achieves extremely small clock skews, while still using a reasonable amount of wire length. This routing solution is based on the construction of a binary tree using recursive geometric mat thing. We show that in the average case the total wire length of the perfect path-balanced tree is within a constant factor of the wire length in an opt imal Steiner tree, and that in the worst case, is bounded by O(@) when the n leaves are arbitrarily distributed in the unit square. we tested our algorithm on numerous random examples and also on industrial benchmark circuits and obtained very promising results: our clock routing yieIds near-zero average clock skew while using similar or even shorter total wire length in comparison with the methods of [7].
منابع مشابه
Matching-based methods for high-performance clock routing
Minimizing clock skew is important in the design of high performance VLSI systems. We present a general clock routing scheme that achieves very small clock skews while still using a reasonable amount of wirelength. Our routing solution is based on the construction of a binary tree using geometric matching. For cell-based designs, the total wirelength of our clock routing tree is on average with...
متن کاملA Bu er Distribution Algorithm for High - PerformanceClock
We introduce a new approach for optimizing clock tree, especially for high-speed circuits. Our approach provides a useful guideline to a designer; by user-speciied parameters, design favors will be satissed. Three of these tradeoos will be provided in this chapter. 1) First, to provide a \good" tradeoo between skew and wirelength, a new clock tree routing scheme is proposed. The technique is ba...
متن کاملHigh-speed All- Optical Time Division Multiplexed Node
In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...
متن کاملModeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models
Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...
متن کامل